Mark without much Sweep Algorithm for Garbage Collection
نویسندگان
چکیده
منابع مشابه
Lock-free parallel garbage collection by Mark&Sweep
This paper presents a lock-free parallel algorithm for mark&sweep garbage collection (GC) in a realistic model using synchronization primitives load-linked (LL)/store-conditional (SC) or compare-and-swap (CAS) offered by machine architectures. Mutators and collectors can simultaneously operate on the data structure. In particular no strict alternation between usage and cleaning up is necessary ...
متن کاملLock-free parallel garbage collection by Mark&Sweep
This paper presents a lock-free parallel algorithm for mark&sweep garbage collection (GC) in a realistic model using synchronization primitives load-linked (LL)/store-conditional (SC) or compare-and-swap (CAS) offered by machine architectures. Mutators and collectors can simultaneously operate on the data structure. In particular no strict alternation between usage and cleaning up is necessary ...
متن کاملGarbage Collection in JyNI - How to bridge Mark/Sweep and Reference Counting GC
Jython is a Java-based Python implementation and the most seamless way to integrate Python and Java. It achieves high efficiency by compiling Python code to Java bytecode and thus letting Java’s JIT optimize it – an approach that enables Python code to call Java functions or to subclass Java classes. It enables Python code to leverage Java’s multithreading features and utilizes Java’s built-in ...
متن کاملA Distributed Garbage Collection Algorithm
Concurrent Scheme extends the Scheme programming language, providing parallel program execution on a distributed network. The Concurrent Scheme environment requires a garbage collector to reclaim global objects; objects that exist in a portion of the global heap located on the node that created them. Because a global object may be referenced by several nodes, traditional garbage collection algo...
متن کاملHot-Swapping Between a Mark&Sweep and a Mark&Compact Garbage Collector in a Generational Environment
This paper describes a novel method for dynamically switching between a Mark&Compact (M&C) and a Mark&Sweep (M&S) garbage collector in the generational memory system of a high performance Java virtual machine. A M&C collector reclaims space by sliding all live objects towards the beginning of the heap. A M&S collector de-allocates garbage objects in-place. In this paper, both algorithms are ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatika
سال: 2014
ISSN: 0005-1144,1848-3380
DOI: 10.7305/automatika.2014.11.857